Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs
نویسندگان
چکیده
منابع مشابه
Arc-transitive cycle decompositions of tetravalent graphs
A cycle decomposition of a graph Γ is a set C of cycles of Γ such that every edge of Γ belongs to exactly one cycle in C. Such a decomposition is called arc-transitive if the group of automorphisms of Γ that preserve C setwise acts transitively on the arcs of Γ . In this paper, we study arc-transitive cycle decompositions of tetravalent graphs. In particular, we are interested in determining an...
متن کاملMonochromatic Directed Walks in Arc-colored Directed Graphs
All graphs considered here are directed and have no loops. For a directed graph D, let V(D) denote the set of vertices of D, 2E(D) its set of arcs, and z(D) the chromatic number of D. D is symmetric iff (x, y)~E(D)~(y, x)EE(D). A directed walk of length k in D is a sequence o f k arcs (not necessarily distinct), e~, e2, ..., ek such that the initial vertex of ei+l is the terminal vertex of e, f...
متن کاملOn intermediate value theorem in ordered Banach spaces for noncompact and discontinuous mappings
In this paper, a vector version of the intermediate value theorem is established. The main theorem of this article can be considered as an improvement of the main results have been appeared in [textit{On fixed point theorems for monotone increasing vector valued mappings via scalarizing}, Positivity, 19 (2) (2015) 333-340] with containing the uniqueness, convergent of each iteration to the fixe...
متن کاملsome properties of fuzzy hilbert spaces and norm of operators
in this thesis, at first we investigate the bounded inverse theorem on fuzzy normed linear spaces and study the set of all compact operators on these spaces. then we introduce the notions of fuzzy boundedness and investigate a new norm operators and the relationship between continuity and boundedness. and, we show that the space of all fuzzy bounded operators is complete. finally, we define...
15 صفحه اولEasy and hard instances of arc ranking in directed graphs
In this paper we deal with the arc ranking problem of directed graphs. We give some classes of graphs for which the arc ranking problem is polynomially solvable. We prove that deciding whether χr(G) ≤ 6, where G is an acyclic orientation of a 3-partite graph is an NP-complete problem. In this way we answer an open question stated by Kratochvil and Tuza in 1999.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1989
ISSN: 0095-8956
DOI: 10.1016/0095-8956(89)90050-6